Penalty cost constrained identical parallel machine scheduling problem
نویسندگان
چکیده
منابع مشابه
Parallel-machine scheduling to minimize tardiness penalty and power cost
0360-8352/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.cie.2012.10.002 q This manuscript was processed by Area Editor T.C ⇑ Corresponding author. Tel.: +886 3 5131472; fax: E-mail addresses: jacky0831@gmail.com (K.-T. Fan (B.M.T. Lin). Traditional research on machine scheduling focuses on job allocation and sequencing to optimize certain objective functions that are defin...
متن کاملTight bounds for the identical parallel machine scheduling problem
We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the so-called lifting procedure. In addition, two optimization-based heuristics are proposed. These heuristics require iteratively solving a subset-sum problem. We present the results of compu...
متن کاملParallel Machine Scheduling Problem
A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...
متن کاملIdentical Parallel Machine Scheduling with Dynamical Networks using Time-Varying Penalty Parameters
The classical identical parallel machine scheduling problem can be stated as follows: Given n jobs and m machines, the problem is to assign each job on one of the identical machines during a fixed processing time so that the schedule that optimizes a certain performance measure is obtained. Having numerous potential applications in real life, in recent years, various research works have been ca...
متن کاملScatter Search Algorithms for Identical Parallel Machine Scheduling Problems
We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.007